Similarity Measure of Graphs

Ranking of generalized fuzzy numbers using distance measure and similarity measure

A similarity measure for graphs with low computational complexity

We present and analyze an algorithm to measure the structural similarity of generalized trees, a new graph class which includes rooted trees. For this, we represent structural properties of graphs as strings and define the similarity of two graphs as optimal alignments of the corresponding property stings. We prove that the obtained graph similarity measures are so called Backward similarity me...

similarity measure for two densities

scott and szewczyk in technometrics, 2001, have introduced a similarity measure for twodensities f1 and f2 , by1, 21 21 1 2 2( , ), ,f fsim f ff f f f< >=< >< >wheref1, f2 f1(x, θ1)f2(x, θ2)dx.+∞−∞< >=∫sim(f1, f2) has some appropriate properties that can be suitable measures for the similarity of f1 and f2 .however, due to some restrictions on the value of parameters and the kind of densities, ...

INTERVAL-VALUED INTUITIONISTIC FUZZY SETS AND SIMILARITY MEASURE

In this paper, the problem of measuring the degree of inclusion and similarity measure for two   interval-valued intuitionistic  fuzzy sets is considered. We propose inclusion and similarity measure by using  order on interval-valued intuitionistic fuzzy sets connected with lexicographical order. Moreover, some properties of inclusion and similarity measure and some correlation, between them an...

Similarity Graphs

The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the issue here is conceptual resemblance. The basis is a knowledge base defining major concepts of the domain and may include taxonomic and ontological domain knowledge. The challenge for support of queries in this context is an evalu...